Papers with generalization ability
Copied to clipboard
| Challenge: | EMNLP 2025 Industry Track highlights key insights, novel research trends and challenges encountered in practical language technology applications. |
| Approach: | Kai Chen will present the technical advances behind the open-source Intern-series large models . he will highlight how models acquire expert-level skills in specialized domains . |
| Outcome: | This talk will highlight the technical advances behind the open-source Intern-series models . it will highlight how models acquire expert-level skills in specialized domains while retaining broad generalization ability. |
Copied to clipboard
| Challenge: | Recent studies have found that Task-oriented Dialogue systems can be more suitable for human users. |
| Approach: | They propose a framework to optimize ToD systems by leveraging Multiple User SimulaTors. |
| Outcome: | The proposed framework improves performance on multiWOZ with human evaluations and automatic evaluations. |
Copied to clipboard
| Challenge: | Recent advances in large language models have improved the detection of non-compliant content, but critical gaps persist in fine-grained understanding, explainability, and generalization. |
| Approach: | They propose a framework that combines active reinforcement learning, fine-grained violation understanding and progressive multi-stage training. |
| Outcome: | The proposed framework outperforms general-purpose LLMs and specialized models in fine-grained violation understanding, explainability, and generalization. |
Copied to clipboard
| Challenge: | Parameter-efficient (PE) methods for adapting pre-trained language models to downstream tasks are still lacking in many cases. |
| Approach: | They propose a general PE priming framework to enhance few-shot adaptation and generalization ability of PE methods. |
| Outcome: | The proposed framework reveals that the best priming strategy facilitates adaptation to target tasks. |
Copied to clipboard
| Challenge: | Pre-trained Chinese language models have shown impressive performance on a wide range of NLP tasks, but the generalization ability of these models has not been well understood. |
| Approach: | They propose to use glyph-phonetic information to improve Chinese spell checking models . they propose a new, more challenging, and practical setting for testing the generalizability of CSC models. |
| Outcome: | The proposed model incorporates glyph-phonetic information and is more challenging and practical. |
Copied to clipboard
| Challenge: | a recent study has found that large language models can generalize compositional instructions from simple instructions to complex ones. |
| Approach: | They study the generalization ability of large language models with respect to compositional instructions . they first construct a dataset with the help of ChatGPT guided by the self-instruct technique . |
| Outcome: | The proposed model can generalize from simple instructions to more intricate ones, the authors show . their results show that training LLMs on higher-order compositional instructions improves performance on lower-order ones, but not on higher order ones. |
Copied to clipboard
| Challenge: | Existing methods for opinion summarization are limited due to the scarcity of data. |
| Approach: | They propose a system to perform unsupervised extractive opinion summarization using a dictionary-based representation learning model that generates topical representations of texts. |
| Outcome: | The proposed system achieves strong performance on three opinion summarization datasets. |
Copied to clipboard
| Challenge: | Existing findings on cross-domain constituency parsing are only made on a limited number of domains. |
| Approach: | They manually annotate a high-quality constituency treebank containing five domains and analyze challenges to open-domain constituency parsing using a set of linguistic features. |
| Outcome: | The proposed model significantly improves the performance of the proposed model on the domain-variant features. |
Copied to clipboard
| Challenge: | Existing models that use VTs as their backbone model are based on UTs that share parameters across layers and have better compositional generalization. |
| Approach: | They propose to use Sparse Mixture of Experts to reduce UT's computation complexity while retaining its parameter efficiency and generalization ability. |
| Outcome: | The proposed model achieves strong generalization results on formal language tasks and impressive parameter and computation efficiency on standard natural language benchmarks. |
Copied to clipboard
| Challenge: | Recent studies suggest the use of general language models for improving natural language processing tasks. |
| Approach: | They propose a method that leverages the second phase to its fullest by applying an extensive number of parallel classifier heads, which are enforced to be orthogonal, while adaptively eliminating the weaker heads during training. |
| Outcome: | The proposed method improves the generalization ability of BERT, sometimes leading to a +9% gain in accuracy. |
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) achieve surprising performance on the Choice of Plausible Alternatives (COPA) task. |
| Approach: | They propose to add a regularization loss to the existing COPA models to mitigate the problem of semantic similarity bias by adding a normalization loss. |
| Outcome: | The proposed model improves generalization ability and performs better on a challenging dataset, BCOPA-CE, which has unbiased token distribution and is more difficult for models to distinguish cause and effect. |
Copied to clipboard
| Challenge: | Existing methods to extract relation triplets from plain text introduce exposure bias . prior work has focused on pipeline methods that ignore intrinsic interactions between subtasks and propagate classification errors through the tasks. |
| Approach: | They propose a model that reduces the decoding length to three within a triplet and removes the order among triplets. |
| Outcome: | The proposed model overfits to both datasets while showing better generalization. |
Copied to clipboard
| Challenge: | Existing approaches to improve generalization ability by augmenting training data with synonymous examples or adding random noises to word embeddings cannot address spurious association problem. |
| Approach: | They propose an end-to-end reinforcement learning framework which jointly performs counterfactual data generation and dual sentiment classification. |
| Outcome: | The proposed framework outperforms strong data augmentation baselines on several benchmark sentiment classification datasets. |
Copied to clipboard
| Challenge: | Existing approaches to machine translation support autoregressive, semi-autoregressive and refinement-based non-auto-regressives. |
| Approach: | They propose a unified approach for supporting different generation manners of machine translation including autoregressive, semi-autoregressive and refinement-based non-auto-regressives. |
| Outcome: | The proposed approach achieves better or competitive translation performance compared with strong baseline models in all the settings. |
Copied to clipboard
| Challenge: | Existing methods focus on improving in-domain performance, leaving open the question of how they can generalize to out-of-domain and unseen RC tasks. |
| Approach: | They propose a multi-task learning framework that learns the shared representation across different tasks and builds on a large pre-trained language model and fine-tuned on multiple RC datasets. |
| Outcome: | The proposed framework improves the BERT-Large baseline by 8.39 and 7.22 respectively. |
Copied to clipboard
| Challenge: | Fixed length summarization (FLS) requires generating summaries with a preset number of characters or words. |
| Approach: | They propose a length control unit called LenAtten to break this trade-off by generating a short and coherent summary with the target length. |
| Outcome: | The proposed model improves controllability and ROGUE scores and generalizes well. |
Copied to clipboard
| Challenge: | Existing methods for temporal sentence grounding ignore two crucial issues . 1) Boundary-bias: the video downsampling process may lose these two frames . 2) Reasoning-biases: such incorrect new boundary frames lead to the reasoning bias . |
| Approach: | They propose a siamese sampling mechanism to generate additional contextual frames . they use a reasoning strategy to learn the inter-relationship among these frames a . |
| Outcome: | Extensive experiments demonstrate the effectiveness of a new siamese sampling network on three challenging datasets. |
Copied to clipboard
| Challenge: | a new method for compositional action recognition is proposed to address the problem of zero-shot learning. |
| Approach: | They propose a method to generalize compositional action recognition models to new verbs and nouns . they use knowledge graphs to extract disentangled feature representations for verbs, noun and type constraint . |
| Outcome: | The proposed approach improves generalization ability of the compositional action recognition model to novel verbs and nouns that are unseen during training time. |
Copied to clipboard
| Challenge: | Various neural networks are designed for text classification on the basis of word embedding, but polysemy is a fundamental feature of the natural language, which brings challenges to text classification. |
| Approach: | They propose to use capsule networks to construct the vectorized representation of semantics and utilize hyperplanes to decompose each capsule to acquire the specific senses. |
| Outcome: | The proposed model extracts more discriminative semantic features and yields significant performance gain compared to baseline methods. |
Copied to clipboard
| Challenge: | Existing models struggle on the text-to-SQL benchmarks, but we propose a method to improve their generalization ability. |
| Approach: | They propose a method to improve the combinatorial generalization of Text-to-SQL models by aligning previous SQL statements with the input utterance. |
| Outcome: | The proposed method improves the generalization ability of Text-to-SQL models. |
Copied to clipboard
| Challenge: | Existing vision-language models focus on salient attributes but ignore contextualized nuances, resulting in gender bias. |
| Approach: | They propose a task-agnostic generation framework to mitigate gender bias in vision-language models. |
| Outcome: | The proposed framework can mitigate gender bias in vision-language models . it yields all-sided but gender-obfuscated narratives, which prevents concentration on localized image features, especially gender attributes. |
Copied to clipboard
| Challenge: | Existing work focuses on assessing in-domain knowledge, but shedding light on what pre-trained Language Models learn is important. |
| Approach: | They propose a method to assess a PLM's generalization capacity in biased scenarios by combining component combinations where it could be easy for the PLMs to learn shortcuts from the training corpus. |
| Outcome: | The proposed model can overcome distribution shifts in the training corpus and with sufficient data. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated exceptional multitasking abilities, but the comprehensive effects of fine-tuning on the LLMs’ generalization ability are not fully understood. |
| Approach: | They conduct extensive experiments across five distinct language tasks on different datasets to investigate whether fine-tuning affects the generalization ability intrinsic to LLMs. |
| Outcome: | The proposed model can generalize to different domains and tasks by integrating the in-context learning strategy during fine-tuning on generation tasks. |
Copied to clipboard
| Challenge: | Existing methods to generalize from seen intents to unseen intents are not effective . Xian et al., 2019: a novel approach to generalized zero-shot intent detection is needed . |
| Approach: | They propose a pairwise prompt-based tuning model with parameter efficient fast adaptation . they leverage hybrid contrastive learning in discriminant space and masked language modeling . |
| Outcome: | The proposed model can generalize to unseen intents with the help of seen intents . the proposed model is based on a pairwise prompt-based tuning model with fast adaptation . |
Copied to clipboard
| Challenge: | Existing methods for question answering over knowledge bases (KBQA) suffer from generalization issues due to coarse-grained modeling of the logical expression. |
| Approach: | They propose a fine-to- coarse-grained framework for KBQA to ensure generalization and executability of the logical expression. |
| Outcome: | The proposed framework derives new state-of-the-art performance on GrailQA and WebQSP, and runs 4 times faster than baseline. |
Copied to clipboard
| Challenge: | Entity linking aims to link entity mentions in texts to knowledge bases, but existing methods rely on local contexts to resolve entities independently. |
| Approach: | They propose a neural model for collective entity linking that integrates local contextual features and global coherence information to improve the computation efficiency. |
| Outcome: | The proposed model improves its performance on five publicly available datasets and can be used to train on Wikipedia hyperlinks to avoid overfitting and domain bias. |
Copied to clipboard
| Challenge: | Existing approaches to compress prompts only leverage unidirectional context, causing suboptimal results. |
| Approach: | They propose a task-agnostic prompt compression method that takes tokens from context . they use a Transformer encoder to capture all essential information needed for prompt compression . |
| Outcome: | The proposed method is 3x-6x faster than existing prompt compression methods and faster than baselines. |
Copied to clipboard
| Challenge: | Recent advances in large language models have broadened their applicability across diverse realworld scenarios. |
| Approach: | They propose to encode rule-based knowledge into large language models by using strong in-context abilities to extract the knowledge from the textual rules and then explicitly encode it into the parameters of LLMs. |
| Outcome: | The proposed learning paradigm is much more efficient than example-based learning in both sample size and generalization ability. |
Copied to clipboard
| Challenge: | Existing models that pursue rapid generalization to new tasks are mostly trained in a single shot on fixed datasets, unable to dynamically expand their knowledge. |
| Approach: | They propose a new learning setup that assumes a model learns from a sequence of diverse NLP tasks arriving sequentially, accumulating knowledge for improved generalization to new tasks. |
| Outcome: | The proposed learning setup improves generalization ability while retaining performance on the tasks learned earlier. |
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have produced non-factual outputs . however, current LLMs suffer from the hallucination issue . |
| Approach: | They propose to use instruction-tuned LLMs to generate factual outputs . they find that FLAN-T5-11B performs best as a fact verifier . |
| Outcome: | The proposed method outperforms more capable LLMs like GPT3.5 and ChatGPT in the human evaluation. |
Copied to clipboard
| Challenge: | Named entity recognition is one of the major subtasks of information extraction for extracting categorized named entities from unstructured text. |
| Approach: | They propose to use retrieval-based span-level graphs to connect spans and entities in the training data based on n-gram features to integrate information of similar neighbor entities into the span representation. |
| Outcome: | The proposed method achieves general improvements on all three benchmarks and special superiority on low frequency entities. |
Copied to clipboard
| Challenge: | Experimental results on the Sem Eval 2014, 15, and 16 datasets demonstrate that InstructABSA outperforms the previous state-of-the-art (SOTA) approaches on Term Extraction (ATE), Sentiment Classification(ATSC) and Sentimence Pair Extraction(ASPE) subtasks. |
| Approach: | They introduce positive, negative, and neutral examples to each training sample, and instruction tune the model (Tk-Instruct) for ABSA subtasks. |
| Outcome: | The proposed model outperforms the state-of-the-art (SOTA) on Term Extraction (ATE), Sentiment Classification (ATSC) and Sentimence Pair Extractions (ASPE) subtasks. |
Copied to clipboard
| Challenge: | Existing studies focus on acquiring relevant knowledge by retrieving external knowledge bases and fine-tuning pre-trained models. |
| Approach: | They propose a two-stage prompt-based unsupervised commonsense question answering framework that leverages implicit knowledge stored in PrLMs to generate knowledge for questions with unlimited types and possible candidate answers independent of specified choices. |
| Outcome: | The proposed framework significantly improves the reasoning ability of language models in unsupervised settings. |
Copied to clipboard
| Challenge: | Existing methods emphasize contextual semantics while others pay more attention to explicit logical features. Existing models utilize graph convolutional networks (GCN) for node updates, still exhibiting some shortcomings. |
| Approach: | They propose a logical reasoning method with contrastive learning and lightweight graph networks (LogiGraph) they employ conjunction and punctuation marks as two types of edges to construct a dual graph. |
| Outcome: | The proposed method improves the GCN and employs conjunction and punctuation marks as two types of edges to construct a dual graph. |
Copied to clipboard
| Challenge: | Existing models for conversation systems operate sentences at word-level . word-based models suffer from Unknown Words Issue and Preference Issue . |
| Approach: | They propose a hybrid-level Encoder-Decoder model which utilizes word-level features and character-level ones. |
| Outcome: | The proposed model outperforms non-word-level models in automatic metrics and human annotations on a Chinese corpus. |
Copied to clipboard
| Challenge: | Current approaches to event extraction fail to model rich interactions among event types and arguments of different roles. |
| Approach: | They propose a new paradigm that formulates event extraction as multi-turn question answering . they propose to use reading comprehension problems to extract triggers and arguments . |
| Outcome: | The proposed approach outperforms current state-of-the-art on argument extraction tasks . it makes full use of dependency among arguments and event types, and generalizes well . |
Copied to clipboard
| Challenge: | Pre-trained text-to-text transformers have achieved impressive performance across a range of NLP tasks, such as question answering and commonsense reasoning. |
| Approach: | They propose a framework that improves text-to-text transformer’s generalization ability to unseen tasks by training a hypernetwork to generate task-specific adapters from task descriptions. |
| Outcome: | Experiments on ZEST and a synthetic SQuAD dataset show that Hypter improves upon fine-tuning baselines. |
Copied to clipboard
| Challenge: | Existing models for pronoun coreference resolution only use triplets, the most common format for knowledge graphs. |
| Approach: | They propose a model that leverages different types of knowledge to resolve pronoun coreference with a neural model. |
| Outcome: | The proposed model outperforms state-of-the-art baselines on two datasets from different domains. |
Copied to clipboard
| Challenge: | Existing methods for QA are hampered by increased training costs . current methods suffer significant performance degradation when applied to out-of-domain examples. |
| Approach: | They propose a method that combines prompting methods and linear probing with fine-tuning strategy, which does not entail additional cost. |
| Outcome: | The proposed method outperforms state-of-the-art baselines with an average increase in F1 score of 4.5%-7.9%. |
Copied to clipboard
| Challenge: | Using COCO-DR, we combat distribution shifts between source training tasks and target scenarios. |
| Approach: | They propose a method to combat distribution shifts between source training tasks and target scenarios by COtinuous COtrastive learning. |
| Outcome: | The proposed method outperforms existing models on BEIR and the giant GPT-3 embedding model with 500x more parameters. |
Copied to clipboard
| Challenge: | Existing methods to extract emotions and causes as pairs neglect effective semantic connections between distant clauses, leading to poor generalization ability towards position-insensitive data. |
| Approach: | They propose a novel multi-granularity semantic-aware Graph model to integrate fine-grained and coarse-grain semantic features together without regard to distance limitation. |
| Outcome: | The proposed model outperforms existing models significantly in position-insensitive data. |
Copied to clipboard
| Challenge: | Existing paradigms further pre-train language models such as BERT on vast amount of unlabeled corpus, but we find it highly effective and efficient to simply fine-tune BERT with roughly 1,000 labeled utterances from public datasets. |
| Approach: | They propose to fine-tune BERT with a small set of labeled utterances from public datasets to achieve a pre-trained model based on a set of 1,000 labeles. |
| Outcome: | The proposed model can outperform existing models on domains with very different semantics on novel domains. |
Copied to clipboard
| Challenge: | Existing models that learn multimodal and multilingual representations perform better in many natural language tasks. |
| Approach: | They use a multimodal and multilingual corpus to test its generalization ability for other languages . they achieve a BLEU score of 51.8 and a METEOR score of 78.0 on the test set . |
| Outcome: | The proposed model outperforms the existing model on a Portuguese-English multimodal translation task. |
Copied to clipboard
| Challenge: | Crowdsourced dialogue corpora are limited in scale and topic coverage due to the expensive cost of data curation. |
| Approach: | They construct an augmented dataset for the emotional support conversation task using large language models for dialogue augmentation. |
| Outcome: | The proposed approach outperforms baselines of dialogue augmentation and improves the model's generalization ability to open-domain topics. |
Copied to clipboard
| Challenge: | Recent studies have shown that models can benefit from query-aware methods for few-shot text classification. |
| Approach: | They propose a dynamic memory-based network for few-short text classification that uses static memory to adapt to unseen classes. |
| Outcome: | The proposed model improves on the miniRCV1 and ODIC datasets by 24% . Detailed analysis is performed to show how the proposed network achieves the new performance. |
Copied to clipboard
| Challenge: | Named entity recognition (NER) systems focus on improving model performance, ignoring the need to quantify model uncertainty. |
| Approach: | They propose to introduce two uncertainty-guided loss terms to the conventional EDL and a series of uncertainty-guiding training strategies to solve these challenges. |
| Outcome: | The proposed method achieves better OOV/OOD detection performance and generalization ability on OOV entities compared to state-of-the-art methods. |
Copied to clipboard
| Challenge: | a new test set shows the deficiency of state-of-the-art models in inferences that require lexical and world knowledge. |
| Approach: | They create a new NLI test set that shows the deficiency of state-of-the-art models in inferences that require lexical and world knowledge. |
| Outcome: | The new examples are simpler than the SNLI test set, but the state-of-the-art systems perform poorly on it. |
Copied to clipboard
| Challenge: | Unified Embeddings for Multimodal Retrieval (UniMuR) is a simple but effective approach that embeds multimodal inputs and retrieves visual and textual outputs via frozen Large Language Models (LLMs). |
| Approach: | They propose a method that embeds multimodal inputs and retrieves visual and textual outputs via frozen Large Language Models (LLMs). |
| Outcome: | The proposed method significantly reduces LLM’s modality bias towards generating text-only outputs and achieves strong image/text retrieval ability. |
Copied to clipboard
| Challenge: | Existing approaches to improve in-context learning performance are highly sensitive to the quality of the incontext examples provided. |
| Approach: | They propose a framework to iteratively train dense retrievers that can identify high-quality in-context examples for large language models. |
| Outcome: | The proposed model improves performance by retrieving examples with similar patterns, and the gains are consistent across LLMs of varying sizes. |
Copied to clipboard
| Challenge: | Existing studies have used labeled sentiment instances to instruction tune LLMs, improving zero-shot sentiment classification performance. |
| Approach: | They propose a simple-yet-efficient method which does not rely on actual labeled sentiment instances. |
| Outcome: | The proposed method outperforms LLMs tuned with more complex instruction tuning methods by 5.1 points and increases scores by 30 points. |
Copied to clipboard
| Challenge: | stance detection methods are designed for specific network types, either homophilic or heterophilic, and fail to generalize to both. |
| Approach: | They propose to generalize a graph neural network based on text embeddings to homophilic and homophilic networks. |
| Outcome: | The proposed model outperforms state-of-the-art methods across heterophilic and homophilic networks. |
Copied to clipboard
| Challenge: | Recent success of natural language processing (NLP) is driven by the adoption of large-scale pretrained language models. |
| Approach: | They propose a method to determine the impact of distillation influence on student generalization ability by prioritizing samples likely to enhance the student's generalization abilities. |
| Outcome: | The proposed method outperforms 10 common knowledge distillation baselines on 6 text classification tasks in the GLUE benchmark. |
Copied to clipboard
| Challenge: | Traditional Chinese characters are still widely used in many areas of China . traditional methods to convert between simplified characters are ineffective . |
| Approach: | They propose an unsupervised adaptive context-aware conversion model that learns to convert between simplified and traditional Chinese characters under a denoising auto-encoder framework. |
| Outcome: | The proposed model outperforms strong unsupervised baselines and yields better conversion result for one-to-many cases. |
Copied to clipboard
| Challenge: | Abstractive summarization is a crucial task in natural language processing . current research focuses on summarizing specific types of documents . domain shifts between documents affect summarisation performance . |
| Approach: | They propose a hierarchical benchmark to capture fine-grained domain shifts in abstractive summarization. |
| Outcome: | The proposed benchmark measures the generalization capabilities of pre-trained language models and large language models in in-domain and cross-domain settings. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a fundamental building block for various downstream natural language processing tasks due to the ambiguous word boundaries and complex composition. |
| Approach: | They propose to resample entities within the same category to encourage a model to leverage both name and context knowledge in the training process. |
| Outcome: | The proposed method significantly improves a model’s ability to detect unseen entities, especially for company, organization and position categories. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have been used in real-world industrial scenarios for various natural language processing tasks, but their high inference cost makes their deployment impractical, necessitating the use of smaller models. |
| Approach: | They propose a continual pre-training technique that generates diverse task instructions and responses via reading comprehension on conversation transcripts, enabling better instruction generalization. |
| Outcome: | The proposed technique improves small LLMs’ domain adaptability for business conversational tasks, compared with traditional methods that rely on next-token prediction. |
Copied to clipboard
| Challenge: | Existing work on rumor detection models has explored network structures, propagation paths, user credibility and fusion of heterogeneous data. |
| Approach: | They propose a method that adapts a rumor detection model trained on source to target topics to make rumour predictions. |
| Outcome: | The proposed method outperforms baseline debiasing methods in a cross-topic setting. |
Copied to clipboard
| Challenge: | Existing approaches to align reasoning abilities between Large Language Models and Smaller Language Model are supervised fine-tuning and preference optimization. |
| Approach: | They propose a method that elicits Smaller Language Models to self-improve their reasoning abilities via preference optimization. |
| Outcome: | The proposed method outperforms Instruction-tuning on commonsense and math reasoning tasks on common and math scenarios. |
Copied to clipboard
| Challenge: | Task-oriented dialogue systems are designed to be composed of several functional modules, but lacks a general-purpose instruction-following language model. |
| Approach: | They propose a fully zero-shot autonomous TOD agent that leverages a general-purpose instruction-following language model to decide what to do at each dialogue turn. |
| Outcome: | The proposed agent can perform tasks in real-life scenarios with a general-purpose instruction-following language model. |
Copied to clipboard
| Challenge: | Existing models for machine reading comprehension use word and character representations, but character is not the minimal unit. |
| Approach: | They propose to use subword rather than character for word embedding enhancement . they also empirically explore different augmentation strategies on subword-augmented embedded embedders . |
| Outcome: | The proposed model outperforms state-of-the-art models on public datasets. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) systems perform well on in-distribution data, but perform poorly on examples drawn from a shifted distribution. |
| Approach: | They propose to use expert-guided heuristics to change entity tokens and their contexts to alter their entity types as adversarial attacks. |
| Outcome: | The proposed model significantly improves performance on the challenging set and out-of-domain generalization. |
Copied to clipboard
| Challenge: | Video-guided machine translation (VMT) aims to improve translation quality by integrating contextual information from paired short video clips. |
| Approach: | They propose a plug-and-play framework for video-guided machine translation with multimodal large language models. |
| Outcome: | The proposed framework improves performance of MLLMs while reducing computational cost. |
Copied to clipboard
| Challenge: | Existing reference-free metrics have obvious limitations for evaluating controlled text generation models. |
| Approach: | They propose an unsupervised reference-free metric which evaluates controlled text generation from different aspects by formulating each aspect into multiple text infilling tasks. |
| Outcome: | The proposed metric has higher correlations with human judgments while obtaining better generalization of evaluating generated texts from different models and with different qualities. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are the default paradigm for natural language processing (NLP) as the models’ scale and the diversity of tasks increase, fine-tuning becomes infeasible. |
| Approach: | They propose to freeze original pretrained weights and train a group of mini LoRAs with only a small number of parameters and reduce their rank by 8 times . |
| Outcome: | The proposed model uses fewer trainable parameters while maintaining a higher rank, thereby offering improved performance potential. |
Copied to clipboard
| Challenge: | Neural machine translation is usually done via knowledge distillation from an autoregressive (AR) model. |
| Approach: | They leverage large monolingual corpora to improve the NAR model's performance by transferring the autoregressive model' s generalization ability while preventing overfitting. |
| Outcome: | The proposed methods on the WMT14 En-De and WMT16 En-Ro news translation tasks show that monolingual data augmentation improves the NAR model to approach the teacher AR model’s performance. |
Copied to clipboard
| Challenge: | Existing few-shot text classification methods lack labeled data in many scenarios. |
| Approach: | They propose a meta learning framework that obtains different learning rates for different tasks and neural network layers to enable the meta learner to quickly adapt to new training data. |
| Outcome: | The proposed framework can obtain different learning rates for different tasks and neural network layers so as to enable the meta learner to quickly adapt to new tasks. |
Copied to clipboard
| Challenge: | Existing work on event-centric reasoning fails to model event-level correlations . Existing studies limit their scope to specific scenarios or overlook event- level correlations. |
| Approach: | They propose to pre-train a general Correlation-aware context-to-Event Transformer for event-centric reasoning by highlighting event-level correlations with effective training. |
| Outcome: | The proposed model is applicable to a wide range of event-centric reasoning scenarios, considering its versatility of event correlation types, application formulations, and reasoning types. |
Copied to clipboard
| Challenge: | Prior knowledge is important in decision-making, and humans preserve it in the form of natural language (NL). |
| Approach: | They propose an environmentagnostic action framework that incorporates prior knowledge into decision-making . they propose to use general semantic schemes to facilitate agent in finding plausible actions . |
| Outcome: | The proposed agent performs better than agents that rely on gamespecific actions. |
Copied to clipboard
| Challenge: | Neural Networks trained with gradient descent are susceptible to catastrophic forgetting due to parameter shift during the training process. |
| Approach: | They propose a semi-parametric approach that relies on local phrase level similarities to retrieve neighboring phrases that are useful for translation even when overall sentence similarity is low. |
| Outcome: | The proposed approach performs well on a heterogeneous dataset with WMT, IWSLT, JRC-Acquis and OpenSubtitles. |
Copied to clipboard
| Challenge: | Aspect-based sentiment analysis models are susceptible to learning spurious correlations between words . a recent study shows that feature engineering is time-consuming and costly . |
| Approach: | They propose to use a template to prompt LLMs to generate an appropriate explanation for the sentiment polarity of each aspect to reduce spurious correlations. |
| Outcome: | The proposed methods improve ABSA models and their generalization ability. |
Copied to clipboard
| Challenge: | ExpBERT is a new approach to guide neural networks with explanations . previous studies have shown that explanations provide valuable inductive biases that guide models, improving generalization ability and data efficiency. |
| Approach: | They propose to use a new inductive bias-based model to guide models with explanations. |
| Outcome: | The proposed explanations achieve comparable results to annotated explanations, but with a significant increase in computational efficiency, 20-30 times faster. |
Copied to clipboard
| Challenge: | Entity linking is a task of assigning entity mentions to referent entities in a knowledge base. |
| Approach: | They propose to use ultra-fine-grained type information to improve the generalization ability of EL models by utilizing a low-level task to extract ultra-finish entity type information. |
| Outcome: | The proposed model achieves state-of-the-art in the zero-shot entity linking task . |
Copied to clipboard
| Challenge: | Existing prompt tuning approaches for attribute-controllable text generation are difficult to implement due to the lack of interpretability of deep neural networks. |
| Approach: | They propose a new approach that incorporates attribute knowledge of discriminator to optimize prompt tuning by steering a frozen CLM to produce attribute-specific texts. |
| Outcome: | The proposed approach can achieve state-of-the-art control performance while maintaining high-quality text generation. |
Copied to clipboard
| Challenge: | Entity-oriented search and neural-IR push the boundary of search engines from two different aspects. |
| Approach: | They propose an Entity-Duet Neural Ranking Model which integrates knowledge graphs into neural search systems. |
| Outcome: | The proposed model improves generalization ability of neural ranking models on a commercial search log. |
Copied to clipboard
| Challenge: | Existing methods to extrapolate and comprehend changes in object states are limited . relying on a small set of symbolic words to represent changes has restricted expressiveness of language. |
| Approach: | They propose a dataset and benchmark to evaluate multimodal large language models . they investigate causal relations between a concrete action and the change . |
| Outcome: | The proposed method achieves near parity with GPT-4V ratings across helpfulness, accuracy, reasoning, and other key metrics. |
Copied to clipboard
| Challenge: | Existing state-of-the-art VLN agents do not generalize well for long navigation tasks. |
| Approach: | They propose a VLN agent that is learned to navigate by decomposing long instructions into shorter ones and completing them sequentially. |
| Outcome: | The proposed agent can follow long instructions better than existing ones, but it does not generalize well. |
Copied to clipboard
| Challenge: | Existing methods for named entity recognition use pre-training language models to represent words, leading to entity type misclassification. |
| Approach: | They propose a model-agnostic framework called MoCL for cross-domain named entity recognition to refine the original representations and combine it with two distinct cross- domain NER methods and two pre-training language models to explore its generalization ability. |
| Outcome: | The proposed framework is model-agnostic and can be used to generalize and refine existing models. |
Copied to clipboard
| Challenge: | Continual Semantic Parsing (CSP) enables parsers to generate SQL from natural language questions in task streams, using minimal annotated data to handle dynamically evolving databases in real-world scenarios. |
| Approach: | They propose a Adaptive PET eXpert meta-learning approach that assists experts in adaptively warming up, ensuring better model initialization. |
| Outcome: | The proposed method outperforms existing methods on two benchmarks and achieves superior performance without data replay or ideal settings. |
Copied to clipboard
| Challenge: | Existing approaches focus on positive paragraphs which contain the answer during training, making it disturbed by similar but irrelevant paragraphs during testing. |
| Approach: | They propose a ranking model leveraging the paragraph-question and the paragraph relevance to compute a confidence score for each paragraph. |
| Outcome: | Experiments on three datasets show that the proposed model advances the state of the art. |
Copied to clipboard
| Challenge: | Empirical studies show that supervised learning is extremely effective in in-domain datasets and models trained on SuperDialseg can achieve good generalization ability on out-of-domain data. |
| Approach: | They propose a supervised definition of dialogue segmentation points using document-grounded dialogues and a large-scale supervised dataset called SuperDialseg. |
| Outcome: | The proposed model can achieve good generalization ability on out-of-domain data. |
Copied to clipboard
| Challenge: | Existing models for temporal knowledge graph reasoning suffer from low training efficiency and insufficient generalization ability. |
| Approach: | They propose a temporal knowledge graph reasoning approach that uses multilayer perceptron to model the structural dependencies of events and adopts a fixed-frequency strategy to incorporate historical frequency during inference. |
| Outcome: | The proposed model achieves state-of-the-art performance with faster convergence speed and better generalization ability. |
Copied to clipboard
| Challenge: | Pre-trained neural language models improve learning for various NLP tasks by fine-tuning them on task-specific training sets. |
| Approach: | They propose a meta-learning procedure to fine-tune neural language models on task-specific training sets. |
| Outcome: | The proposed procedure solves a group of similar NLP tasks on a text mining dataset. |
Copied to clipboard
| Challenge: | Recent studies show flat minima tend to imply better generalization abilities . however, it has some difficulty implying SAM to some natural language tasks . |
| Approach: | They propose a flatness-aware minimization algorithm that can be applied to natural language tasks . they propose to use parameter corruptions to explain why flat minima generalize better . |
| Outcome: | The proposed algorithm can generalize better for flat minima that are robust against corruptions or perturbations. |
Copied to clipboard
| Challenge: | Existing methods for question generation over knowledge bases rely on annotated data for fine-tuning . emergence of Large Language Models (LLMs) has shown impressive generalization ability in few-shot tasks. |
| Approach: | They propose to use a logical form to generate a question in a reasoning problem . they propose to extend the prompting method into a method that can generate questions in logical forms . |
| Outcome: | The proposed method outperforms baselines on three public KBQG datasets. |
Copied to clipboard
| Challenge: | Existing tokenization methods focus on information-theoretical goals like high compression and low fertility rather than linguistic goals like morphological alignment. |
| Approach: | They propose to incorporate morphological knowledge into tokenization to improve both morphology and downstream performance. |
| Outcome: | The proposed tokenization improves overall performance on four downstream tasks. |
Copied to clipboard
| Challenge: | Recent advances show strong evidence of generalization in spatiotemporal modalities such as robotic manipulation. |
| Approach: | They propose a method for converting a reinforcement learning model into a natural language understanding model by a teacher-student imitation learning method. |
| Outcome: | The proposed model outperforms teacher performance on held-out decision problems by 7% and 24% on out-of-domain problems. |
Copied to clipboard
| Challenge: | Existing methods for fine-tuning large language models (LLMs) introduce parameter interference, leading to a gap in generalization performance for specific tasks compared to full fine-uning. |
| Approach: | They propose a parameter-separated low-rank adapter to account for task differences by decomposing LoRA’s parameter matrix into multiple independent subspaces and assigning them differentially to distinct tasks. |
| Outcome: | The proposed method outperforms LoRA in trainable parameter efficiency and overall model performance on various NLP tasks. |
Copied to clipboard
| Challenge: | Recent work shows that Code Large Language Models can address a wide range of code-related tasks. |
| Approach: | They propose a method to generate widespread and versatile instruction data from open source code datasets and use it to train code-related models. |
| Outcome: | The proposed model outperforms open-source models in generalization ability across code-related tasks. |
Copied to clipboard
| Challenge: | Recent work has demonstrated reinforcement learning and weighted decoding as effective approaches to achieve a higher level of language control and quality with pros and cons. |
| Approach: | They propose a method that combines reinforcement learning and weighted decoding to train a critic from reward models. |
| Outcome: | The proposed method generates more coherent and well-controlled texts than previous methods on three controlled generation tasks, topic control, sentiment control, and detoxification. |
Copied to clipboard
| Challenge: | Existing MFND methods conduct cross-modal information interaction at later stage, resulting in weak generalization ability. |
| Approach: | They propose an automatic multi-modal fake news detection method that exploits cross-modal information interaction at later stage. |
| Outcome: | The proposed method outperforms state-of-the-art methods on three MFND benchmarks. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have emerged as powerful assistants for scientific writing, but reliability of LLM alone is in doubt. |
| Approach: | They propose a retrieval-aware agent framework to provide more faithful grounding for citation validation. |
| Outcome: | The proposed framework improves over the baseline and achieves 68.1% accuracy on the CiteME benchmark, approaching human performance. |
Copied to clipboard
| Challenge: | Multilingual models have gained popularity for their zero-shot cross-lingual transfer learning capabilities, but their generalization ability is inconsistent for typologically diverse languages. |
| Approach: | They propose a meta-learning approach that adapts MAML to learn to adapt to new languages . they extensively evaluate two cross-lingual NLU tasks using English as source and spanish as target . |
| Outcome: | The proposed approach outperforms naive fine-tuning on cross-lingual tasks for most languages. |
Copied to clipboard
| Challenge: | Empirical evaluations on the GLUE benchmark demonstrate that fine-tuning can enhance the generalization performance of pre-trained language models (PLMs) in downstream tasks. |
| Approach: | They propose a fine-tuning framework that transforms the latent representation of pre-trained language models from a universal space to a target space and integrates a generative adversarial network into the fine-untun process. |
| Outcome: | Empirical evaluations on the GLUE benchmark and two additional demanding scenarios show that the proposed framework can improve the generalization performance of pre-trained language models (PLMs) in downstream tasks. |
Copied to clipboard
| Challenge: | Recent advances in conversational IR systems have seen a resurgent interest in conversation . generative query rewrite generates reconstructed query based on the conversation history . |
| Approach: | They propose to use unlabeled data to make further improvements using contrastive co-training paradigm. |
| Outcome: | The proposed model is robust to noise and language style shift under few-shot and zero-shot scenarios. |
Copied to clipboard
| Challenge: | Dense retrieval (DR) methods first encode texts into a dense embedding space and then conduct text retrieval using efficient nearest neighbor search. |
| Approach: | They propose Momentum adversarial Domain Invariant Representation learning to train a domain classifier that distinguishes source versus target domains and adversarially updates the DR encoder to learn domain invariant representations. |
| Outcome: | The proposed method outperforms baselines on 10+ ranking datasets collected in the BEIR benchmark in the zero-shot setting, with more than 10% relative gains on datasets with enough sensitivity for DR models’ evaluation. |
Copied to clipboard
| Challenge: | Existing visual relationship detection models only use numeric ids of relation labels for training, but ignore semantic correlation between labels. |
| Approach: | They propose a visual Relationship prediction framework that transfers natural language knowledge from Contrastive Language-Image Pre-training models to enhance the relationship prediction. |
| Outcome: | The proposed framework improves visual relationship prediction by matching semantic correlations with relation triplets. |
Copied to clipboard
| Challenge: | Existing methods for word-level segmentation (CWS) for the Chinese language have been successful in large-scale annotated corpora. |
| Approach: | They propose a method that integrates different segmentation criteria into one model . they use a transfer learning method to improve the performance of OOV words . |
| Outcome: | The proposed method achieves state-of-the-art performance on multiple benchmark datasets . it shows a competitive practicability and generalization ability for the CWS task . |
Copied to clipboard
| Challenge: | a language model-based error detection method can learn errors with a small training sample. |
| Approach: | They propose a language model-based method for grammatical error detection with feedback comments. |
| Outcome: | The proposed method can learn errors with a little training data and improve recall faster than non-language models. |
Copied to clipboard
| Challenge: | Existing evaluation methods for text summarization systems are limited to in-domain setting, where supervised pre-trained models are evaluated on the same dataset. |
| Approach: | They propose to use a cross-dataset evaluation approach to evaluate different summarization systems in a multi-domain setting. |
| Outcome: | The proposed model can be used to evaluate text summarization systems on different datasets. |
Copied to clipboard
| Challenge: | Existing methods of fine-tuning vision-language navigation models require extra human-labeled data and lack self-exploration capabilities in environments. |
| Approach: | They propose a method that can self-explore environments without human labeling . they use a large-scale cross-modal pretrained model to build an in-domain dataset . |
| Outcome: | The proposed model can self-explore environments without human labeling without human supervision and generates structured instructions without human intervention. |
Copied to clipboard
| Challenge: | Existing studies on how LLMs achieve cross-lingual alignment and generalization have not explored the intrinsic mechanisms of how they achieve crosslingual alignment. |
| Approach: | They propose to remove a core region that corresponds to linguistic competence and set parameters to zero to reduce performance across 30 different languages. |
| Outcome: | The proposed model can be used to perform tasks requiring abstract knowledge and reasoning in complex languages. |
Copied to clipboard
| Challenge: | Existing task-oriented dialog systems are less than satisfactory in robustness evaluation . existing systems are weak in robustity evaluation based on pre-training and fine-tuning . |
| Approach: | They propose to use a set of training examples to evaluate model generalization ability . they propose to include tasks with limited training data to favor models with strong generalization abilities . |
| Outcome: | The proposed model generalizes well with limited training data and is robust to user input across domains. |
Copied to clipboard
| Challenge: | Pretrained language models can be fine-tuned on limited training data, which can overfit and thus diminish performance. |
| Approach: | They propose a fine-tuning strategy that selectively updates model parameters using gradients from various sub-nets dynamically generated by dropout. |
| Outcome: | The proposed method outperforms existing methods on the GLUE benchmark and exhibits excellent generalization ability and robustness for domain transfer, data imbalance, and low-resource scenarios. |
Copied to clipboard
| Challenge: | Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy. |
| Approach: | They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction. |
| Outcome: | The proposed model improves generalization ability and makes distant link prediction significantly easier. |
Copied to clipboard
| Challenge: | Existing studies for understanding programs do not take human behaviors as reference. |
| Approach: | They propose a graph neural network model that takes human behaviors as reference in understanding programs. |
| Outcome: | The proposed model performs better on code summarization and code clone detection tasks. |
Copied to clipboard
| Challenge: | Existing methods for domain adaptation of abstractive dialogue summarization lack generalization ability on new domains. |
| Approach: | They propose a domain-oriented prefix-tuning model that uses a prefix module to alleviate domain entanglement and discrete prompts to guide the model to focus on key contents of dialogues. |
| Outcome: | The proposed model can be generalized to two multi-domain dialogue summarization datasets. |
Copied to clipboard
| Challenge: | Existing interpretation methods fail to obtain faithful attributions on these models, thereby failing to reveal potential flaws and biases. |
| Approach: | They propose a Contrastive learning regularization method which calibrates the sentence representation of out-of-distribution examples and utilizes adversarial examples to introduce direction information in regularization. |
| Outcome: | The proposed method alleviates the model pathology while impacting generalization ability on in-distribution examples and thus helps interpretation methods obtain more faithful results. |
Copied to clipboard
| Challenge: | Dense retrieval has shown promise in the first-stage retrieval process when trained on in-domain labeled datasets. |
| Approach: | They propose a method to capture matching signal to improve generalization of dense retrieval by capturing matching signal between two texts. |
| Outcome: | The proposed method can be combined with different training methods to improve generalization ability without additional inference overhead and target domain data. |
Copied to clipboard
| Challenge: | despite recent progress, learning new tasks through language instructions remains a challenging problem. |
| Approach: | They propose a hierarchical task learning approach that decomposes task learning into three sub-problems and a model that addresses each sub-probability in a unified manner. |
| Outcome: | The proposed model achieves the state-of-the-art performance on the AL-FRED benchmark . it decomposes task learning into three sub-problems and addresses them in a unified manner . |
Copied to clipboard
| Challenge: | Pre-trained Language Models (PLMs) exhibit good accuracy and generalization ability but their large size results in high inference latency. |
| Approach: | They propose an unsupervised domain adaptation framework that employs knowledge distillation to achieve domain-invariant representations at each layer. |
| Outcome: | The proposed framework outperforms early exit methods and domain adaptation methods under domain shift scenarios. |
Copied to clipboard
| Challenge: | Online abusive content detection, particularly in low-resource settings, remains underexplored. |
| Approach: | They propose to use pre-trained audio representations to detect abusive language in Indian languages using Few Shot Learning (FSL) . |
| Outcome: | The proposed model can be used to classify abusive language in 10 languages using the ADIMA dataset with FSL. |
Copied to clipboard
| Challenge: | Prior studies have shown that ChatGPT achieves comparable results to commercial systems for high-resource languages, but lags behind in complex tasks, e.g., low-resourced and distant-language-pairs translation. |
| Approach: | They propose task-specific prompts and domain-specific prompts which are based on task information and domain information and a task-specific prompt. |
| Outcome: | The proposed prompts improve the performance of ChatGPT in complex tasks and generate hallucinations for non-English-centric tasks. |
Copied to clipboard
| Challenge: | Prior research has shown that LLMs fail to perform satisfactorily on moral cognizance tasks . |
| Approach: | They propose to use curated datasets to improve LLMs' moral cognizance . they find pragmatic dilemma constrains generalization ability of current learning paradigms . |
| Outcome: | The proposed learning paradigms fail to perform on moral cognizance tasks, the authors show . they show that the pragmatic dilemma is the primary bottleneck for moral reasoning acquisition . |
Copied to clipboard
| Challenge: | Recent research has found that text classification datasets contain certain unintended biases, such as text containing demographic identity-terms that are more likely to be abusive. |
| Approach: | They propose a model-agnostic debiasing framework that recovers the non-discrimination distribution using instance weighting, which does not require extra resources or annotations apart from a pre-defined set of demographic identity-terms. |
| Outcome: | The proposed framework alleviates the unintended biases without hurting models’ generalization ability. |
Copied to clipboard
| Challenge: | Continual fine-tuning of large language models suffers from catastrophic forgetting . some approaches use routers to assign tasks to experts, but continual learning often requires retraining . |
| Approach: | They propose a framework that integrates routing and response mechanisms within each expert . it eliminates the need for an additional router and allows each expert to decide whether a query should be handled . |
| Outcome: | The proposed framework outperforms previous approaches in continual fine-tuning . it can handle learning tasks and out-of-distribution instances, paving the way for distributed model ensembling. |
Copied to clipboard
| Challenge: | Pre-trained language models typically lead to high computational cost during inference. |
| Approach: | They propose a slowdown attack framework that can reduce inference efficiency by 80% by leveraging existing adversarial attacks targeting model accuracy. |
| Outcome: | The proposed framework can reduce the efficiency of multi-exit models by 80% on average, validating its effectiveness and generalization ability. |
Copied to clipboard
| Challenge: | Existing approaches to fine-tune visual-language understanding (VLU) require tasks-specific designs and sufficient training data. |
| Approach: | They propose a simple yet efficient paradigm for low-resource Visual Language Understanding (VLU) they reformulate a series of VLU tasks as an open-book affinity-matching problem. |
| Outcome: | The proposed framework outperforms baselines in low-resource settings. |
Copied to clipboard
| Challenge: | Existing models for grammatical error correction use pseudo data, but they are inconvenient for realworld deployment due to large amounts of training data. |
| Approach: | They propose a method to evaluate whether GEC models can generalize to unseen errors by using synthetic and real GEC datasets with controlled vocabularies. |
| Outcome: | The proposed model fails to realize grammatical generalization even in simple settings with limited vocabulary and syntax, suggesting it lacks the generalization ability required to correct errors from provided training examples. |
Copied to clipboard
| Challenge: | Existing studies utilize social media platforms such as Twitter to build models for crisis event analysis, but semi-supervised approaches require annotating vast amounts of data and are impractical due to limited response time. |
| Approach: | They propose a method that stores and performs equal sampling for generated pseudo-labels from each class at each training iteration. |
| Outcome: | The proposed method performs better than existing methods in both in-distribution and out-of-difference settings. |
Copied to clipboard
| Challenge: | Existing approaches to improve the generalization of large language models are using Supervised Fine-Tuning (SFT) this approach does not show sufficient generalization ability because it only relies on the given CoT data. |
| Approach: | They propose to use Chain-of-Thought annotations to train Large Language Models using supervised fine-tuning to improve generalization. |
| Outcome: | The proposed approach outperforms SFT on GSM8K, MathQA, and SVAMP datasets and shows a superior generalization ability. |
Copied to clipboard
| Challenge: | State-of-the-art unsupervised multilingual models generalize in zero-shot cross-lingual setting . generalization ability attributed to shared subword vocabulary and joint training across multiple languages . |
| Approach: | They propose an approach that transfers a monolingual model to new languages at the lexical level. |
| Outcome: | The proposed approach is competitive with multilingual BERT on cross-lingual classification benchmarks and on a new cross-linguistic question answering dataset. |
Copied to clipboard
| Challenge: | Existing studies fail to consider the importance of the semantic interaction between sentence features and neglect to enhance the generalization ability of the model to new tasks. |
| Approach: | They propose to integrate an adversarial network architecture into the meta-learning system and leverage cost-effective modules to build a few-shot classification framework called SaAML. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on four benchmark datasets. |
Copied to clipboard
| Challenge: | a method for process supervision has shown significant improvements in multi-step problem solving . despite the advances in process supervision, there are still easily observable mistakes in state-of-the-art LLMs. |
| Approach: | They propose a method for automating data curation by using a trained verifier to evaluate intermediate steps generated by a reasoner. |
| Outcome: | The proposed method improves the performance of PaLM 2 on math and coding tasks. |
Copied to clipboard
| Challenge: | Natural Language Sentence Matching (NLSM) is a popular NLP task. |
| Approach: | They propose to use QuoraQP to train and evaluate NLSM models using a selection bias framework. |
| Outcome: | The proposed framework can improve generalization ability of trained models and give more trustworthy evaluation results for real-world adoptions. |
Copied to clipboard
| Challenge: | Existing methods for interpreting and processing diverse mathematical modalities are limited . existing systems are limited in interpreting complex mathematical tasks and implementing them in a multimodal manner. |
| Approach: | They propose a multimodal mathematical reasoning system that utilizes a fine-tuned T5 model augmented with a variational autoencoder (VAE)-based image tokenizer. |
| Outcome: | The proposed model achieves state-of-the-art performance on SVAMP, GeoQA, and TableMWP datasets and is generalized on two additional datasets. |
Copied to clipboard
| Challenge: | Existing semantic parsing models struggle to adapt to unseen database schemas . a new architecture, ShadowGNN, processes schemas at abstract and semantic levels . |
| Approach: | They propose a new architecture which processes schemas at abstract and semantic levels. |
| Outcome: | The proposed architecture outperforms state-of-the-art models on a text-to-sql benchmark . it uses domain-independent representations to extract logical linking between question and schema . |
Copied to clipboard
| Challenge: | a comprehensive and fine-grained measurement of the hallucination is crucial for LLMs' wide applications. |
| Approach: | They propose a dataset that offers ANalytical Annotation of Hallucinations in Large Language Models. |
| Outcome: | The proposed dataset can be used to train and evaluate hallucination annotators. |
Copied to clipboard
| Challenge: | Existing literature focuses on integrating domain-specific knowledge into LLMs to enhance accuracy using a fixed task template. |
| Approach: | They propose a collection of supervised learning tasks augmented with labels derived from a conventional recommender model to improve LLMs’ proficiency in adhering to recommendation-specific instructions. |
| Outcome: | The proposed approach significantly improves the capability of LLMs to respond to instructions within recommender systems, reducing formatting errors while maintaining a high level of accuracy. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable abilities in complex reasoning through chain of thought (CoT) prompting. |
| Approach: | They propose to generate multiple rationales for each question and enforce consistency among their predictions by minimizing the bidirectional KL-divergence between the answer distributions. |
| Outcome: | The proposed model achieves superior performance on in-distribution and commonsense reasoning benchmarks. |
Copied to clipboard
| Challenge: | Existing multi-task learning approaches for large language models fall short due to computational intensive or lack of simultaneous task convergence. |
| Approach: | They propose a new multi-task learning approach that dynamically adjusts task weights during the training process, ensuring that the validation loss of all tasks progresses towards convergence at an even pace. |
| Outcome: | The proposed approach improves the performance of large language models by up to 13% compared to the second-best approaches. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are capable of performing tasks but are likely to be misused. |
| Approach: | They propose a zero-shot black-box method to detect LLM-generated texts . they revise the text to be detected using the ChatGPT model . |
| Outcome: | The proposed method can detect LLM-generated texts with a zero-shot black-box model . it is based on intuition that the model will make fewer revisions to LLMs than to human-written texts . |
Copied to clipboard
| Challenge: | State-of-the-art abstractive summarization models rely on extensive labeled data, which lowers their generalization ability on domains where such data are not available. |
| Approach: | They propose to use domain adaptation methods to simulate the low-resource domain adaptation setting for abstractive summarization systems with existing datasets across six diverse target domains. |
| Outcome: | The proposed model can be used to adapt to a low-resource domain adaptation setting. |
Copied to clipboard
| Challenge: | Existing approaches to zero-shot learning are format-agnostic and can address new learning tasks without additional training. |
| Approach: | They propose a new paradigm for zero-shot learning that is format agnostic and compatible with any format and applicable to a list of language tasks. |
| Outcome: | The proposed model shows state-of-the-art performance on several benchmarks and produces satisfactory results on tasks such as text classification and commonsense reasoning. |
Copied to clipboard
| Challenge: | Existing approaches for few-shot Named Entity Recognition (NER) are evaluated mainly under in-domain settings, but little is known about how these models perform in cross-domain NER using labeled in- domain examples. |
| Approach: | They propose to use a rationale-centric data augmentation method to improve model generalization ability by allowing model to learn from a few labeled examples in a new target domain. |
| Outcome: | The proposed method improves the performance of cross-domain NER tasks compared to the counterfactual data augmentation and prompt-tuning methods. |
Copied to clipboard
| Challenge: | Context information is one of the key factors for extractive summarization, but other factors can be used to identify sentence importance. |
| Approach: | They propose to disentangle context and pattern factors for extractive summarization . they separate context and patterns for a better generalization ability in low-resource setting . |
| Outcome: | The proposed model can be used in the zero-shot setting or fine-tuned in the few-shot settings. |
Copied to clipboard
| Challenge: | ReasonFormer is a unified reasoning framework for complex decision-making . it is based on the dual-process theory of cognitive science, where two cognitive systems interact to form a whole reasoning process. |
| Approach: | They propose a unified reasoning framework that mirrors the modular reasoning process of humans . they decouple the representation module and the reasoning modules to capture different levels of cognition . |
| Outcome: | The proposed framework shows that humans can perform better in complex decision-making tasks. |
Copied to clipboard
| Challenge: | Metaphor detection aims to distinguish between metaphorical and literal expressions in text. |
| Approach: | They propose an attribute likeness and domain inconsistency learning framework for wordpair metaphor detection based on conceptual metaphor theory . they model attribute likeity with an attribute siamese network and devise a domain contrastive learning strategy to learn semantic inconsistentness of concepts in source and target domains . |
| Outcome: | The proposed framework outperforms existing word-pair and token-level methods on four datasets. |
Copied to clipboard
| Challenge: | Medical data and tasks require extensive preprocessing and standardization for effective use in training LLMs. |
| Approach: | They propose to use MedINST as a meta-dataset to evaluate LLMs' generalization ability. |
| Outcome: | The meta-dataset of biomedical instruction measures the generalization ability of LLMs across multiple open-domain tasks. |
Copied to clipboard
| Challenge: | Existing approaches to correct wrong slot values in dialogue state tracking are intertwined with specific DST models, limiting their applicability to other DSTs. |
| Approach: | They propose a Scalable Dialogue State Correction model that corrects wrong slot values in predicted dialogue states by using a structural template prompt. |
| Outcome: | The proposed model achieves state-of-the-art results on MultiWOZ 2.0-2.4. |
Copied to clipboard
| Challenge: | Existing automatic metrics are observed to correlate poorly with human evaluation. |
| Approach: | They propose to use OpenMEVA to evaluate open-ended story generation metrics. |
| Outcome: | The proposed test suite assesses the capabilities of open-ended story generation metrics on annotated stories and auto-constructed test examples. |
Copied to clipboard
| Challenge: | Named entity recognition models are evaluated on their ability to identify entity mentions in text. |
| Approach: | They propose a method to reduce the amount of entity contamination in NER datasets by a minimum cut algorithm. |
| Outcome: | The proposed method minimizes train-test entity leakage while ensuring near zero entity contamination. |
Copied to clipboard
| Challenge: | Existing studies attribute catastrophic forgetting to fine-tuning, and they retain pre-trained knowledge indiscriminately without identifying what knowledge is transferable. |
| Approach: | They propose a unified objective for fine-tuning to retrieve the causality back from pre-trained data and use it to mitigate negative transfer while preserving knowledge. |
| Outcome: | The proposed method outperforms state-of-the-art fine-tuning methods on commonsense QA datasets and can be implemented as a plug-in module to inflate the performance of existing QA models. |
Copied to clipboard
| Challenge: | Experimental results show that the proposed selective token generation algorithm outperforms the previous additive learning algorithms based on the PLMs. |
| Approach: | They propose an additive learning algorithm that selectively outputs language tokens between a task-general PLM and a specific adapter during training and inference. |
| Outcome: | The proposed algorithm outperforms existing methods on few-shot natural language generation tasks. |
Copied to clipboard
| Challenge: | Existing image captioning approaches treat image-caption pairs indistinctly without considering the differences in their learning difficulties. |
| Approach: | They propose a pretrained vision–language model that measures cross-modal similarity and a model that uses cross-module similarity to measure the difficulty of captioning. |
| Outcome: | The proposed model achieves superior performance and competitive convergence speed to baselines without incurring additional training costs. |
Copied to clipboard
| Challenge: | Existing methods for expressive text-to-speech only implicitly learn prosody with masked token reconstruction tasks. |
| Approach: | They propose a cross-modal contrastive pre-training framework that learns from prosody variance of the same text token under different contexts. |
| Outcome: | The proposed framework can learn from prosody variance of a text token under different contexts. |
Copied to clipboard
| Challenge: | Recent neural methods for keyphrase extraction are mostly observed in documents originating from the scientific domain. |
| Approach: | They develop a neural keyphrase extraction model that goes beyond language understanding to handle the variations of domain and content quality. |
| Outcome: | The proposed model can handle the variations of domain and content quality without restriction of the domain, quality, nor content of the documents. |
Copied to clipboard
| Challenge: | Existing models for dialogue summarization focus on document summarizing on time and speaker-centered points, but this approach is limited in understanding the dialogue. |
| Approach: | They propose a 2D view of dialogue based on a time-speaker perspective where the time and speaker streams of dialogue can be obtained as strengthened input. |
| Outcome: | The proposed model outperforms existing models on the QMSum dataset and improves summary faithfulness and human evaluation. |
Copied to clipboard
| Challenge: | Existing methods for lightweight fine-tuning are ineffective in low-resource settings but fail in high-resourced settings, leading to unreliable outcomes. |
| Approach: | They propose a calibration strategy that takes into account the inherent variance of generalization ability in model components and potential changes during the fine-tuning process. |
| Outcome: | The proposed calibration improves GLUE score by 3.1 points over the previous calibration method. |
Copied to clipboard
| Challenge: | Existing evaluation metrics for natural language generation (NLG) tasks face the challenges on generalization ability and interpretability. |
| Approach: | They propose a metric that evaluates natural language generation tasks as an instruction-style question answering task and utilizes instruction-tuned pre-trained language models without training on evaluation datasets. |
| Outcome: | The proposed metric achieves state-of-the-art performance in untrained metrics for evaluating text summarization and dialogue generation, which exhibits strong dimension-level / task-level generalization ability and interpretability. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have significantly impacted various domains, especially through organized LLM-driven autonomous agents. |
| Approach: | They propose a framework that enables orchestrated teams to jointly propose various task-oriented solutions and interact with their insights in a self-independence while cross-team collaboration environment for superior solutions generation. |
| Outcome: | Experiments show that the framework can generate better software quality compared to state-of-the-art frameworks. |
Copied to clipboard
| Challenge: | Existing methods for AVE are limited on rare attributes due to poor generalization ability. |
| Approach: | They propose to leverage pretraining and transfer learning to address weaknesses in existing methods. |
| Outcome: | The proposed method achieves new state-of-the-art performance without pretraining on rare attributes with limited training resources. |
Copied to clipboard
| Challenge: | Despite the success of language models using neural networks, it remains unclear to what extent neural models have the generalization ability to perform inferences. |
| Approach: | They propose a method to evaluate whether neural models can learn systematicity of monotonicity inference in natural language. |
| Outcome: | The proposed method shows that neural models can perform inferences on unseen combinations of lexical and logical phenomena when syntactic structures are similar between training and test sets. |
Copied to clipboard
| Challenge: | Existing models for sentence classification use linear convolution, which may not be sufficient to model the non-consecutive dependency of the phrase and may overfit the sequential information. |
| Approach: | They propose a model that extracts multi-scale n-gram features for understanding the semantic meaning of sentences by some key-phrases located at different positions. |
| Outcome: | The proposed model outperforms existing models on eight benchmark datasets and is competitive against state-of-the-art models. |
Copied to clipboard
| Challenge: | Text classification tasks often encounter few-shot scenarios with limited labeled data, and addressing data scarcity is crucial. |
| Approach: | They propose a self-evolution learning (SE) based mixup approach for data augmentation in text classification which generates more adaptive and model-friendly pseudo samples for the model training. |
| Outcome: | The proposed approach can generate more adaptive and model-friendly pseudo samples for the model training. |
Copied to clipboard
| Challenge: | Existing supervised sentence embedding techniques rely on expensive human-annotated sentence pairs as the supervised signals. |
| Approach: | They propose a semi-supervised sentence embedding framework that leverages large-scale unlabeled data. |
| Outcome: | The proposed framework surpasses state-of-the-art methods on four domain adaptation tasks. |
Copied to clipboard
| Challenge: | Existing methods for IE tasks suffer from inconsistent schema representation and implicitly intermediate reasoning . UC-UIE adopts a low-rank adapted hierarchical Mixture-of-Experts adapter for UIE tasks . |
| Approach: | They propose a framework that decomposes IE reasoning into three universal capabilities . UC-UIE adopts a low-rank Adaptation adapter to fine-tune LLMs for IE tasks . |
| Outcome: | The proposed framework outperforms full-parameter tuning methods with 1.24% trainable parameters and outperformed existing methods in generalization and interpretability. |
Copied to clipboard
| Challenge: | Existing studies measure the superiority of DA methods in terms of their performance on a specific test set, but some do not exhibit consistent improvements across translation tasks. |
| Approach: | They propose to evaluate DA methods from two perspectives to determine their generalization ability . they find that DA method's test performance does not exhibit consistent improvements across translation tasks . |
| Outcome: | The proposed methods do not exhibit consistent improvements across translation tasks. |
Copied to clipboard
| Challenge: | a new method to detect clickbait posts on the Web is needed to detect such posts. |
| Approach: | They propose a method to detect clickbait posts on the Web using latent factors . they use features in multiple modalities to characterize the posts and causal inference to eliminate noise . |
| Outcome: | The proposed method can detect clickbait posts on popular social media platforms with good generalization ability. |
Copied to clipboard
| Challenge: | We argue that knowledge-retrieval and reasoning tasks are not ideal for measuring generalization, as LLMs are not trained for specific tasks. |
| Approach: | They propose a statistically motivated framework using personalization to assess generalization in Large Language Models. |
| Outcome: | The proposed framework outperforms existing models on movie and music recommendation datasets, but all models have room for improvement, especially Llama. |
Copied to clipboard
| Challenge: | Commercial news provides rich semantics and timely information for automated financial risk detection. |
| Approach: | They propose a semi-supervised Semantic-Topological Iteration Network, STINMatch, along with a news-enterprise knowledge graph to endorse the risk detection enhancement. |
| Outcome: | The proposed model outperforms existing models in terms of generalization and semantics and annotation. |
Copied to clipboard
| Challenge: | Instruction tuning is an effective way of aligning large language models with private instruction data. |
| Approach: | They propose a training-free strategy to derive improved emulators from LLMs by using Offsite-Tuning (OFT) they propose CRaSh, which transfers transformer blocks between centralized LLM and downstream emulators . |
| Outcome: | The proposed technique boosts performance of large language models with billions of parameters. |
Copied to clipboard
| Challenge: | Large-scale Language Models (LLMs) have shown the ability for in-context learning. |
| Approach: | They propose a progressive reasoning strategy tailored to addressing complex linguistic phenomena such as intensification, contrast, irony and limited number of tokens allowed in in-context learning. |
| Outcome: | The proposed model performs better on 4 out of 5 widely-used text-classification benchmarks, while demonstrating comparable performance to SOTA on MR. |
Copied to clipboard
| Challenge: | Existing approaches on semantic parsing suffer from exponential growth of logical form candidates and can hardly generalize to unseen data. |
| Approach: | They propose a unified semantic parser for question answering on KB and DB . they define the primitive as the essential element in their framework . |
| Outcome: | The proposed framework can predict logical forms by altering and composing top-ranked primitives with different operations. |
Copied to clipboard
| Challenge: | Aspect-based Sentiment Analysis (ABSA) data augmentation has attracted increasing attention in recent years due to data sparsity. |
| Approach: | They propose a framework to augment ABSA data using pseudo labels for target domain . they refine generated labeled data using a natural language inference filter . |
| Outcome: | The proposed framework outperforms 7 strong baselines on 4 kinds of ABSA tasks. |
Copied to clipboard
| Challenge: | Existing approaches to training a dialogue state tracking model require extensive annotated dialogue data. |
| Approach: | They propose to transfer cross-task knowledge from general question answering corpora to QA model that can handle zero-shot DST. |
| Outcome: | The proposed model improves existing zero-shot and few-shot results on MultiWoz and shows better generalization ability in unseen domains. |
Copied to clipboard
| Challenge: | Prior studies have focused on designing customized MAS for specific tasks . a critical research question remains: do LLM agent groups exhibit a form of "general intelligence" |
| Approach: | They find a Collective Intelligence factor in human groups that captures their general capability. |
| Outcome: | The proposed model predicts the ACI factor based on the features of LLM agent groups and can improve generalization abilities. |
Copied to clipboard
| Challenge: | Large Language Models (LLMs) exhibit exceptional translation capabilities in high-resource language tasks, yet their effectiveness in low-resourced languages is suboptimal. |
| Approach: | They conduct extensive multilingual continual pre-training on the LLaMA series models and develop LLiMAX for translation support across more than 100 languages. |
| Outcome: | The proposed model achieves higher translation performance than existing open-source models and performs on-par with specialized translation model on the Flores-101 benchmark. |
Copied to clipboard
| Challenge: | Recent supervised ED approaches have achieved promising performance but require large number of manually annotated event data. |
| Approach: | They propose to overfit the trigger confounder of the context and the result . they propose to intervene on the context via backdoor adjustment during training . |
| Outcome: | The proposed method significantly improves the FSED on ACE05 and MAVEN datasets. |
Copied to clipboard
| Challenge: | Existing paragraph embedding methods do not capture basic linguistic properties, but their performance is limited. |
| Approach: | They propose a paragraph embedding method that can't tell whether a sentence occurs in a given paragraph. |
| Outcome: | The proposed method outperforms reconstruction-based methods on a semi-supervised dataset and improves on benchmark datasets. |
Copied to clipboard
| Challenge: | Analogical reasoning has long been used in mathematical education, as it enables students to apply common relational structures of mathematical situations to solve new problems. |
| Approach: | They propose to leverage analogical MWPs to advance the solver’s generalization ability across different kinds of MWps. |
| Outcome: | The proposed model has a stronger generalization ability in solving difficult MWPs due to the analogical learning from easy MWPS. |
Copied to clipboard
| Challenge: | Existing studies that create problem variants by adding perturbations to a single problem focus on the interaction between problems. |
| Approach: | They propose a pipeline with 98.2% accuracy to combine two original problems with a logical connection and to evaluate LLMs' generalization ability on the compositional problems. |
| Outcome: | The proposed pipeline can combine two original problems with a logical connection to get a new math problem and evaluate its compositional generalization on the compositional problems. |
Copied to clipboard
| Challenge: | Existing studies have shown that instruction tuning is effective for generalizing to arbitrary tasks unseen during training. |
| Approach: | They propose to introduce learnable instructions and optimize them with gradient descent to optimize instruction for generalization ability. |
| Outcome: | The proposed instruction extractor extracts appropriate instruction and improves generalization ability compared to manual instruction tuning. |
Copied to clipboard
| Challenge: | Existing training-based model editing methods struggle to incorporate new knowledge while preserving unrelated general knowledge. |
| Approach: | They propose a framework that uses geometric relationships to differentiate between neurons associated with new knowledge updates and those related to general knowledge perturbations. |
| Outcome: | The proposed framework avoids updating neurons with directions approximately orthogonal to existing knowledge, thus preserving the model’s generalization ability. |
Copied to clipboard
| Challenge: | Existing AES models are either prompt-specific or prompt-adaptive and cannot generalize well on “unseen” prompts. |
| Approach: | They propose a prompt-aware neural AES model to extract comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features. |
| Outcome: | The proposed model extracts comprehensive representation for essay scoring, including both prompt-invariant and prompt-specific features. |
Copied to clipboard
| Challenge: | Existing methods for data-to-text generation rely on labeled data, which is costly to acquire and limits their application to new tasks and domains. |
| Approach: | They propose to leverage pre-training and transfer learning to address this problem by leveraging a general knowledge-grounded generation model and a knowledge-based model. |
| Outcome: | The proposed model can generate knowledge-enriched text on a knowledge-grounded text corpus crawled from the web in three settings. |
Copied to clipboard
| Challenge: | a novel generalization framework for visual temporal-aligned translation is proposed to transfer recognition skills to unseen performers . ambiguity in the visual sequence can hinder current methods for visual language translation . |
| Approach: | They propose a generalizable framework to transfer recognition skills to unseen performers . they use visual temporal-aligned translation to generate multiple words autoregressively . |
| Outcome: | The proposed framework is generalized to transfer recognition skills to unseen performers . it is compared with existing methods on lipreading and fingerspelling datasets . |
Copied to clipboard
| Challenge: | Existing methods for continual learning in language models suffer catastrophic forgetting when learning sequential tasks. |
| Approach: | They propose an orthogonal low-rank adaptation approach for continual learning in language models that uses orthogons to learn sequentially. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on continual learning benchmarks and preserves generalization ability of LLMs on unseen tasks. |
Copied to clipboard
| Challenge: | Existing pre-trained language models for hate speech detection are not specialized in implicit hate speech. |
| Approach: | They propose a pre-trained language model for implicit hate speech detection that leverages machine-generated data to train the model. |
| Outcome: | The proposed model can be trained on a massive hate speech dataset with positive samples . it can be generalized and reduce identity term bias, the authors show . |
Copied to clipboard
| Challenge: | Existing models for information extraction (IE) use a one-stage learning strategy to extract the target structure from unstructured text data. |
| Approach: | They propose a unified easy-to-hard learning framework that mimics the human learning process by breaking down the learning process into multiple stages. |
| Outcome: | The proposed framework enables the model to acquire general IE task knowledge and improve its generalization ability on 13 out of 17 datasets. |
Copied to clipboard
| Challenge: | Existing LLM agents generate verbose and inefficient natural language plans to guide reasoning, which restricts agents’ ability to generalize across similar tasks. |
| Approach: | They propose a pseudocode-style planning guide optimization method that captures the structural logic of reasoning and uses two planning-oriented rewards to enhance agent learning. |
| Outcome: | The proposed method outperforms existing LLM agents on representative agent benchmarks and outperformed the current leading baselines. |
Copied to clipboard
| Challenge: | Experimental results show that weak-to-strong generalization significantly improves PGR compared to naive weak- to-strong . superalignment refers to how humans can align models on tasks beyond human ability to evaluate . |
| Approach: | They propose a framework that elicits the capabilities of strong models through weak supervisors . they propose 'superalignment' to ensure that strong models align with supervisors' intentions . |
| Outcome: | The proposed framework significantly improves quality of supervision signals and quality of input questions compared to naive weak-to-strong generalization . |
Copied to clipboard
| Challenge: | Existing text-to-SQL parsers are often over-confident, thus casting doubt on their trustworthiness when deployed for real use. |
| Approach: | They propose a parser-independent error detection model for text-to-SQL semantic parsing . they use a language model of code as its bedrock and graph neural networks to learn structural features of queries . |
| Outcome: | The proposed model outperforms parser-dependent uncertainty metrics on three strong parsers . it could improve the performance and usability of text-to-SQL semantic parsing, it is shown . |
Copied to clipboard
| Challenge: | Named entity recognition models require abundant high-quality annotations to train . distant supervision may induce incomplete and noisy labels, making supervised learning ineffective. |
| Approach: | They propose a noise-robust learning scheme for training named entity recognition models using only distantly-labeled data and a self-training method that uses contextualized augmentations created by pre-trained language models. |
| Outcome: | The proposed method outperforms existing supervised NER models on three datasets by significant margins. |
Copied to clipboard
| Challenge: | Existing methods to improve sentence representation learning (SRL) ignore the potential interference problems across tasks and instances. |
| Approach: | They propose a multi-task instruction tuning method that arranges the order of multi- task data for training to minimize interference risks. |
| Outcome: | The proposed method can boost the performance of state-of-the-art methods. |
Copied to clipboard
| Challenge: | Prompt-based fine-tuning has boosted performance of Pre-trained language models on few-shot Natural Language Understanding (NLU) tasks by employing task-specific prompts. |
| Approach: | They propose a Cloze-driven prompt framework for prompt tuning that implicitly stimulates knowledge from pre-trained language models. |
| Outcome: | The proposed framework outperforms state-of-the-art for prompt-based fine-tuning on few-shot NLU tasks. |
Copied to clipboard
| Challenge: | Existing models of sentiment understanding do not consider interrelated sentiment knowledge . et al., 2023; Zhao e.t., 20, 21; Shu e t. 2021) focus on individual sentiment subtasks . |
| Approach: | They propose an open-source large language model specific to the sentiment domain that explores hierarchical relationships between subtasks. |
| Outcome: | The proposed model performs well across all datasets in the progressive sentiment reasoning benchmark. |
Copied to clipboard
| Challenge: | Effective summarisation evaluation metrics enable researchers and practitioners to compare different summarization systems efficiently. |
| Approach: | They argue that evaluation metrics are primarily meta-evaluated on news summarisation datasets and that there has been a noticeable shift in research focus towards evaluating the faithfulness of generated summaries. |
| Outcome: | The evaluation metrics are primarily meta-evaluated on news summarisation datasets and there has been a noticeable shift in research focus towards evaluating the faithfulness of generated summaries. |
Copied to clipboard
| Challenge: | Hallucination remains a key challenge in applying large language models to structured query generation . we propose the Self-Debating framework to enhance detection performance . |
| Approach: | They propose a framework that prompts an LLM to generate contrastive explanations from opposing perspectives . they also propose 'self-debating' framework to enhance detection performance . |
| Outcome: | The proposed framework outperforms LLM-as-a-Judge baselines in hallucination detection . the framework generates contrastive explanations from opposing perspectives . |
Copied to clipboard
| Challenge: | Existing tool-learning methods often overlook fine-grained optimization of internal tool call details. |
| Approach: | They propose a training paradigm for constructing token-level tool-use preference datasets . reversed dataset construction is a method for creating high-quality, multi-turn tool-user datasets by reversing the generation flow. |
| Outcome: | a new training paradigm improves tool-using performance and generalizes results. |
Copied to clipboard
| Challenge: | Large language models (LLMs) are shown to perform better when asked to reason step-by-step before generating a final answer. |
| Approach: | They propose a framework to tailor small-sized LMs to generate correct reasoning steps and robustly reason over these steps. |
| Outcome: | The proposed framework outperforms four competitive baselines and improves the robustness and generalization ability of the reasoning LM, yielding higher performance on out-of-distribution test sets. |
Copied to clipboard
| Challenge: | Recent diagnostic datasets on compositional generalization expose severe problems . state-of-the-art models trained on larger and more general datasets show better generalization ability . |
| Approach: | They conduct an empirical analysis by training Transformer models on a variety of training sets with different data factors including dataset scale, pattern complexity, example difficulty, etc. |
| Outcome: | The proposed model training on larger datasets improves on compositional generalization tasks. |
Copied to clipboard
| Challenge: | Experimental results show that the methods enhanced by DEFT outperform the original methods in both alignment capability and generalization ability, with significantly reduced training time. |
| Approach: | They propose a distribution-based alignment framework that integrates data filtering and distributional guidance to improve alignment efficiency and generalization ability. |
| Outcome: | The proposed framework outperforms existing methods in alignment capability and generalization ability with significantly reduced training time. |
Copied to clipboard
| Challenge: | Existing methods focus on the candidate retrieval stage and ignore the essential candidate ranking stage, which disambiguates among entities and makes the final linking prediction. |
| Approach: | They propose a read-and-select framework that models the main components of entity disambiguation . they use mention context to output mention-aware entity representations . |
| Outcome: | The proposed framework achieves state-of-the-art performance on established zero-shot entity linking dataset ZESHEL with 2.55% micro-average accuracy gain, with no need for laborious multi-phase pre-training used in most of the previous work. |
Copied to clipboard
| Challenge: | Reinforcement Learning from Human Feedback (RLHF) is an effective approach for aligning language models to human preferences. |
| Approach: | They compare the accuracy of DPORM and EXRM with a reward function for scoring human preferences. |
| Outcome: | The proposed methods can approximate an EXRM on the limit infinite samples, but it is unclear how effective they are in practice. |
Copied to clipboard
| Challenge: | Existing approaches to adapt pre-trained language models (PLMs) to emerging tasks are costly and inefficient. |
| Approach: | They propose a meta-network that generates task-specific weights without any optimization. |
| Outcome: | The proposed approach has flexible generalization ability and superior performance over hypenetworks. |
Copied to clipboard
| Challenge: | Existing zero-shot slot filling methods show limited generalization ability in target domain . et al., 2018: empirical results show that proposed method is better than existing methods . |
| Approach: | They propose a hierarchical contrastive learning framework for zero-shot slot filling . they use Gaussian-distributed embedding to learn generalized deep semantic relations . |
| Outcome: | The proposed method performs better than existing methods on unseen slot types . empirical results show that the proposed method can generalize to unseense slot types. |
Copied to clipboard
| Challenge: | Existing studies in Emotion Recognition in Conversations (ERC) focus on capturing context-sensitive and speaker-sensitive dependencies, ignoring the unintended dataset biases of data. |
| Approach: | They propose a training-free debiasing framework that extracts biases from the model by generating counterfactual utterances and contexts and mitigates them using simple yet empirically robust element-wise subtraction operations. |
| Outcome: | Experiments on three public datasets show that the proposed framework improves generalization ability and fairness across different ERC models. |
Copied to clipboard
| Challenge: | Existing mitigation strategies for Text-to-Speech systems require excessive training resources or inference latency. |
| Approach: | They propose a GFlOwNet-guided distribution AlignmenT framework that mitigates hallucinations without relying on massive resources or inference latency. |
| Outcome: | The proposed framework reduces over 50% character error rates and lowers uncertainty by up to 58% on challenging test cases. |
Copied to clipboard
| Challenge: | Effective domain adaptation typically involves supervised fine-tuning on carefully selected instruction-tuned data. |
| Approach: | They propose a model-centric data selection framework that aligns data selection with the model’s knowledge distribution to improve model performance. |
| Outcome: | The proposed framework outperforms existing methods by up to 2.97% accuracy in the healthcare domain. |
Copied to clipboard
| Challenge: | Existing methods focus on specializing LMs in mathematical reasoning and rely on knowledge distillation. |
| Approach: | They propose a multi-view fine-tuning method that exploits existing mathematical problem datasets with diverse annotation styles. |
| Outcome: | The proposed method outperforms existing methods that rely heavily on LLM teachers . it grants models generalization ability across views and datasets, and the capability to learn from inaccurate or incomplete data. |
Copied to clipboard
| Challenge: | Current approaches to temporal knowledge representation face limited generalization to unseen facts and insufficient interpretability of reasoning processes. |
| Approach: | They propose a framework that uses a denoising diffusion process to complete reasoning tasks . they propose introducing a noise source and historical conditionguiding mechanism to improve interpretability . |
| Outcome: | The proposed framework outperforms state-of-the-art methods on three benchmark datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks for conversational machine reading comprehension are inconsistent with real scenarios. |
| Approach: | They propose to use a Chinese CMRC benchmark to evaluate model's generalization ability towards diverse domains by using zero-shot/few-shot settings. |
| Outcome: | The proposed benchmarks are based on 831 hot-topic driven conversations with 4,742 turns and cover 33 domains. |
Copied to clipboard
| Challenge: | Recent studies have introduced Large Language Models (LLMs) for this task to enhance the models’ generalization abilities. |
| Approach: | They propose a General-to-Specific learning framework that disentangles the learning processes of two kinds of knowledge in a temporal temporal structure. |
| Outcome: | The proposed framework disentangles the learning processes of the above two kinds of knowledge and improves their generalization abilities. |
Copied to clipboard
| Challenge: | Existing large language models can perform abstract reasoning tasks but are they actually engaging in rule-based reasoning beyond mere memorization? |
| Approach: | They propose a method to examine whether large language models perform abstract reasoning . they fine-tune the model to learn those contradictory rules and assess its generalization ability . |
| Outcome: | The proposed approach examines whether large language models perform abstract reasoning by altering their original understanding of fundamental rules. |
Copied to clipboard
| Challenge: | Existing studies have focused on lexical- and sentence-level simplification, leaving long text simplification comparatively unexplored . |
| Approach: | They propose a two-level and progressive LLM-based framework that establishes an effective paradigm for automatic long text simplification under diverse test scenarios. |
| Outcome: | The proposed framework outperforms advanced and proprietary LLMs in in-domain and out-of-domain simplification tasks and matches or outperformed existing LLM frameworks. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have limited awareness of output length, making it difficult to satisfy precise length requirements. |
| Approach: | They propose a model-agnostic approach that introduces dynamic length markers to guide length-controllable outputs. |
| Outcome: | The proposed method significantly reduces length deviation across multiple datasets. |
Copied to clipboard
| Challenge: | a recent study using LLMs has relied on outdated datasets and limited generalization ability on unseen texts. |
| Approach: | They construct a large-scale dataset of political discourse and use it to make three judgments . they identify distinct patterns and demonstrate tendencies of label agreement using a leave-one-out strategy. |
| Outcome: | The proposed approach is applicable in real-world settings with inherent constraints. |
Copied to clipboard
| Challenge: | Existing methods for enhancing LLM reliability suffer from inefficient information aggregation and rigid reasoning schemes. |
| Approach: | They propose a method that explicitly models external knowledge integration capabilities by explicitly modeling knowledge relationships. |
| Outcome: | The proposed method outperforms existing methods in multiple graph reasoning tasks. |
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) have shown strong performance in document image tasks, especially Optical Character Recognition (OCR). However, they struggle with Document Image Machine Translation (DIMT), which requires handling both cross-modal and cross-lingual challenges. |
| Approach: | They propose a novel fine-tuning paradigm that allows the model to generate OCR text before producing translation text, which allows it to leverage its strong monolingual OCR ability while learning to translate text across languages. |
| Outcome: | The proposed model can leverage its strong monolingual OCR ability while learning to translate text across languages. |
Copied to clipboard
| Challenge: | Prompt compression is important for large language models to increase inference speed, reduce computation cost, and improve user experience. |
| Approach: | They propose a method that compresses natural language contexts into a special token . they propose to reduce computations and memory costs by reducing the complexity . |
| Outcome: | The proposed method reduces computations and memory costs by 27-90% . it retains 70-74% and 77-84% of the LLM capabilities at high compression ratios . |
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) is an important task for many downstream applications. |
| Approach: | They propose to use self-knowledge distillation to learn a low-dimensional model from a pre-trained high-dimensional one. |
| Outcome: | The proposed model can improve model performance while maintaining lightweight structure. |
Copied to clipboard
| Challenge: | Data selection techniques have shown empirical benefits in reducing the number of gradient steps to train neural models. |
| Approach: | They propose to modify an existing data selection technique to adapt it to the sequence losses typical in language modeling. |
| Outcome: | The proposed technique reduces the number of steps required to train neural models by 4.3% and improves generalization ability on out of domain datasets. |
Copied to clipboard
| Challenge: | Existing benchmarks have exposed patterns and may not truly assess generalization ability of Large Language Models (LLMs). |
| Approach: | They propose a “Generalization Stress Test” to assess Large Language Models’ generalization ability under slight and controlled perturbations, including option length, problem types, and irrelevant noun replacements. |
| Outcome: | The proposed test shows that LLMs exhibit severe accuracy drops and unexpected biases when faced with minor but content-preserving modifications. |
Copied to clipboard
| Challenge: | Linguistic and domain confounders introduce spurious correlations, leading to poor out-of-distribution (OOD) performance. |
| Approach: | They propose a novel post-hoc, neuron-level intervention framework to disentangle AI-generated text detection factors from data-specific biases. |
| Outcome: | The proposed framework reduces topic-specific biases by encoding individual neurons within transformers-based detectors rather than task-specific signals. |
Copied to clipboard
| Challenge: | Existing methods rely on text retrieval and geographic knowledge bases to generate coordinates, and they are prone to error propagation and dependency on structured knowledge bases. |
| Approach: | They propose to use large language models to convert geographic coordinates into geohash sequences and introduce a Chain-of-Thought mechanism to enhance the model’s reasoning over spatial relationships. |
| Outcome: | The proposed framework can handle explicit address queries in single-point predictions and effectively resolve vague relative location queries. |
Copied to clipboard
| Challenge: | Recent evidence suggests that language models with human-scale pretraining data may possess a similar generalization ability by generalizing from frequent to rare constructions. |
| Approach: | They construct a synthetic benchmark that targets syntactic and semantic properties of the English Let-Alone construction and compare it with a human-scale transformer language model. |
| Outcome: | The proposed model can generalize from frequent to rare constructions, but human-scale models do not make correct generalizations about Let-Alone’s meaning. |
Copied to clipboard
| Challenge: | Large language models (LLMs) have achieved significant performance in various natural language reasoning tasks, but struggle with performing first-order logic reasoning over formal logical theories expressed in natural language. |
| Approach: | They propose a framework which introduces the paradigm of resolution refutation to solve first-order logic reasoning problems by extending reasoning rules and employing the principle of proof by contradiction. |
| Outcome: | The proposed framework outperforms existing models while maintaining performance in simple scenarios. |
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) tasks require detecting the span and category of the entity from the text block. |
| Approach: | They propose a kNN retrieval enhancement algorithm that incorporates word segmentation information to enhance the model’s generalization ability and alleviate the problem of missing entity tokens in prediction. |
| Outcome: | The proposed method improves the performance of baseline models and achieves better or compared recognition accuracy than previous state-of-the-art models in multiple public Chinese and English datasets. |
Copied to clipboard
| Challenge: | Existing LRMs often suffer from "overthinking" and excessively long reasoning traces . a dual-level framework for length compression of LRM is proposed . |
| Approach: | They propose a framework for prefix-protected and difficulty-aware compression under hierarchical supervision. |
| Outcome: | The proposed framework reduces token usage while improving accuracy on math benchmarks. |
Copied to clipboard
| Challenge: | Prompt tuning has achieved remarkable progress in vision–language models, but its generalization ability in ALMs remains underexplored. |
| Approach: | They propose a plug-and-play framework that regularizes the prompt embedding space . they propose introducing a semantic expansion loss with margin constraints that promote compactness . |
| Outcome: | The proposed framework regularizes the prompt embedding space by incorporating semantic neighbors generated by large language models. |